INTEGER t-SHIFT CODES AND FACTORING ABELIAN GROUPS
نویسنده
چکیده
Let p a be prime number. Using algebraic methods from the factorization theory of abelian groups we will prove a result about the structure of the 1-error correcting t-shift integer codes over the alphabet Zp in the special case when t is a prime. The algorithms to construct such codes can take advantage of this extra structural information in a straightforward manner and the search for these codes can be speed up dramatically. Mathematics Subject Classification (2010): Primary 94B60; Secondary 20K01
منابع مشابه
Idempotent Polynomials: An Easy Supplant to Generator Polynomials
Cyclic codes are very useful in error correcting codes. Hence, the construction of good cyclic codes is of utmost importance. A generic class of polynomials called generator polynomials is used to construct the cyclic codes. Finding a generator polynomial necessitates factoring a base polynomial called monic polynomial. Unfortunately, factoring a polynomial is not always an easy task. Idempoten...
متن کاملCyclic Quantum Error-Correcting Codes and Quantum Shift Registers
Quantum error-correction will be an essential building-block for the physical implementation of a quantum computer since it is unlikely that the coherence time of a quantum mechanical system is long enough to perform any computation of interest, such as factoring large numbers (see ?). The last years have seen a great progress in the theory of quantum error-correcting codes (see, e.g., ?; ?). T...
متن کاملNormalizer Circuits and Quantum Computation
In this thesis, we introduce new models of quantum computation to study the potential and limitations of quantum computer algorithms. Our models are based on algebraic extensions of the qubit Clifford gates (CNOT, Hadamard and π/4-phase gates) and Gottesman’s stabilizer formalism of quantum codes. We give two main kinds of technical contributions with applications in quantum algorithm design, c...
متن کاملVerifiable Partial Escrow of Integer Factors
We construct an eecient interactive protocol for realizing veriiable partial es-crow of the factors of an integer n with time-delayed and threshold key recovery features. The computational cost of the new scheme amounts to 10k log 2 P multiplications of numbers of size of P , where P is a protocol parameter which permits n of size up to (log 2 P) ? 4 to be dealt with and k is a security paramet...
متن کاملBased on RSA and Factoring
Abstract—Non-malleability is an important property in commitment schemes. It can resist to the person-in-the-middle (PIM) attacks within the interaction. In this paper, we focus on the non-malleability in ID-based trapdoor commitments. We first give two constructions of (full) ID-based trapdoor commitment schemes based on RSA and Factoring assumptions respectively and then extend them to non-m...
متن کامل